'Weak Dependency Graph [60.0]'
------------------------------
Answer:           YES(?,O(n^1))
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  a(c(x1)) -> a(x1)
     , a(c(b(c(x1)))) -> c(b(c(c(x1))))
     , c(x1) -> b(a(a(x1)))}

Details:         
  We have computed the following set of weak (innermost) dependency pairs:
   {  a^#(c(x1)) -> c_0(a^#(x1))
    , a^#(c(b(c(x1)))) -> c_1(c^#(b(c(c(x1)))))
    , c^#(x1) -> c_2(a^#(a(x1)))}
  
  The usable rules are:
   {  a(c(x1)) -> a(x1)
    , a(c(b(c(x1)))) -> c(b(c(c(x1))))
    , c(x1) -> b(a(a(x1)))}
  
  The estimated dependency graph contains the following edges:
   {a^#(c(x1)) -> c_0(a^#(x1))}
     ==> {a^#(c(b(c(x1)))) -> c_1(c^#(b(c(c(x1)))))}
   {a^#(c(x1)) -> c_0(a^#(x1))}
     ==> {a^#(c(x1)) -> c_0(a^#(x1))}
   {a^#(c(b(c(x1)))) -> c_1(c^#(b(c(c(x1)))))}
     ==> {c^#(x1) -> c_2(a^#(a(x1)))}
   {c^#(x1) -> c_2(a^#(a(x1)))}
     ==> {a^#(c(b(c(x1)))) -> c_1(c^#(b(c(c(x1)))))}
   {c^#(x1) -> c_2(a^#(a(x1)))}
     ==> {a^#(c(x1)) -> c_0(a^#(x1))}
  
  We consider the following path(s):
   1) {  a^#(c(x1)) -> c_0(a^#(x1))
       , c^#(x1) -> c_2(a^#(a(x1)))
       , a^#(c(b(c(x1)))) -> c_1(c^#(b(c(c(x1)))))}
      
      The usable rules for this path are the following:
      {  a(c(x1)) -> a(x1)
       , a(c(b(c(x1)))) -> c(b(c(c(x1))))
       , c(x1) -> b(a(a(x1)))}
      
        We have applied the subprocessor on the union of usable rules and weak (innermost) dependency pairs.
        
          'Weight Gap Principle'
          ----------------------
          Answer:           YES(?,O(n^1))
          Input Problem:    innermost runtime-complexity with respect to
            Rules:
              {  a(c(x1)) -> a(x1)
               , a(c(b(c(x1)))) -> c(b(c(c(x1))))
               , c(x1) -> b(a(a(x1)))
               , a^#(c(x1)) -> c_0(a^#(x1))
               , c^#(x1) -> c_2(a^#(a(x1)))
               , a^#(c(b(c(x1)))) -> c_1(c^#(b(c(c(x1)))))}
          
          Details:         
            We apply the weight gap principle, strictly orienting the rules
            {  a(c(b(c(x1)))) -> c(b(c(c(x1))))
             , a^#(c(b(c(x1)))) -> c_1(c^#(b(c(c(x1)))))}
            and weakly orienting the rules
            {}
            using the following strongly linear interpretation:
              Processor 'Matrix Interpretation' oriented the following rules strictly:
              
              {  a(c(b(c(x1)))) -> c(b(c(c(x1))))
               , a^#(c(b(c(x1)))) -> c_1(c^#(b(c(c(x1)))))}
              
              Details:
                 Interpretation Functions:
                  a(x1) = [1] x1 + [1]
                  c(x1) = [1] x1 + [0]
                  b(x1) = [1] x1 + [0]
                  a^#(x1) = [1] x1 + [3]
                  c_0(x1) = [1] x1 + [2]
                  c_1(x1) = [1] x1 + [1]
                  c^#(x1) = [1] x1 + [0]
                  c_2(x1) = [1] x1 + [1]
              
            Finally we apply the subprocessor
            We apply the weight gap principle, strictly orienting the rules
            {  a(c(x1)) -> a(x1)
             , a^#(c(x1)) -> c_0(a^#(x1))}
            and weakly orienting the rules
            {  a(c(b(c(x1)))) -> c(b(c(c(x1))))
             , a^#(c(b(c(x1)))) -> c_1(c^#(b(c(c(x1)))))}
            using the following strongly linear interpretation:
              Processor 'Matrix Interpretation' oriented the following rules strictly:
              
              {  a(c(x1)) -> a(x1)
               , a^#(c(x1)) -> c_0(a^#(x1))}
              
              Details:
                 Interpretation Functions:
                  a(x1) = [1] x1 + [10]
                  c(x1) = [1] x1 + [10]
                  b(x1) = [1] x1 + [14]
                  a^#(x1) = [1] x1 + [2]
                  c_0(x1) = [1] x1 + [0]
                  c_1(x1) = [1] x1 + [1]
                  c^#(x1) = [1] x1 + [0]
                  c_2(x1) = [1] x1 + [3]
              
            Finally we apply the subprocessor
            'fastest of 'combine', 'Bounds with default enrichment', 'Bounds with default enrichment''
            ------------------------------------------------------------------------------------------
            Answer:           YES(?,O(n^1))
            Input Problem:    innermost relative runtime-complexity with respect to
              Strict Rules:
                {  c(x1) -> b(a(a(x1)))
                 , c^#(x1) -> c_2(a^#(a(x1)))}
              Weak Rules:
                {  a(c(x1)) -> a(x1)
                 , a^#(c(x1)) -> c_0(a^#(x1))
                 , a(c(b(c(x1)))) -> c(b(c(c(x1))))
                 , a^#(c(b(c(x1)))) -> c_1(c^#(b(c(c(x1)))))}
            
            Details:         
              The problem was solved by processor 'Bounds with default enrichment':
              'Bounds with default enrichment'
              --------------------------------
              Answer:           YES(?,O(n^1))
              Input Problem:    innermost relative runtime-complexity with respect to
                Strict Rules:
                  {  c(x1) -> b(a(a(x1)))
                   , c^#(x1) -> c_2(a^#(a(x1)))}
                Weak Rules:
                  {  a(c(x1)) -> a(x1)
                   , a^#(c(x1)) -> c_0(a^#(x1))
                   , a(c(b(c(x1)))) -> c(b(c(c(x1))))
                   , a^#(c(b(c(x1)))) -> c_1(c^#(b(c(c(x1)))))}
              
              Details:         
                The problem is Match-bounded by 1.
                The enriched problem is compatible with the following automaton:
                {  a_1(3) -> 9
                 , b_0(3) -> 3
                 , a^#_0(3) -> 4
                 , a^#_1(9) -> 8
                 , c^#_0(3) -> 7
                 , c_2_1(8) -> 7}